Tham khảo Đồ_thị_hai_phía

  1. ↑ Asratian, Armen S., Tristan MJ Denley, and Roland Häggkvist. Bipartite graphs and their applications. Vol. 131. Cambridge University Press, 1998.
  2. 1 2 D. König, Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre,Math. Ann. 77 (1916), no. 4, 453–465.
  3. ↑ Asratian, Denley & Häggkvist (1998)Lỗi harv: không có mục tiêu: CITEREFAsratianDenleyHäggkvist1998 (trợ giúp), Theorem 2.1.3, p. 8. Asratian et al. attribute this characterization to a 1916 paper by Dénes Kőnig.
  4. ↑ Kőnig, Dénes (1936), Theorie der endlichen und unendlichen Graphen, Leipzig: Akademische Verlagsgesellschaft. Translated from German by Richard McCoart, Theory of finite and infinite graphs, Birkhäuser, 1990, ISBN 0-8176-3389-8
  5. 1 2 3 Giải thuật và lập trình (Lê Minh Hoàng), Đại Học Sư Phạm Hà Nội, 1999-2002
  6. 1 2 Scheinerman, Edward A. (2012), Mathematics: A Discrete Introduction (ấn bản 3), Cengage Learning, tr. 363, ISBN 9780840049421 .
  7. ↑ Ovchinnikov, Sergei (2011), Graphs and Cubes, Universitext, Springer . See especially Chapter 5, "Partial Cubes", pp. 127–181.
  8. ↑ Asratian, Denley & Häggkvist (1998)Lỗi harv: không có mục tiêu: CITEREFAsratianDenleyHäggkvist1998 (trợ giúp), p. 7.
  9. ↑ Biggs, Norman (1994), Algebraic Graph Theory, Cambridge Mathematical Library (ấn bản 2), Cambridge University Press, tr. 53, ISBN 9780521458979 .
  10. ↑ Moon, Todd K. (2005), Error Correction Coding: Mathematical Methods and Algorithms, John Wiley & Sons, tr. 638, ISBN 9780471648000 .
  11. ↑ Grünbaum, Branko (2009), Configurations of Points and Lines, Graduate Studies in Mathematics 103, American Mathematical Society, tr. 28, ISBN 9780821843086 .

Liên quan